#pragma GCC optimize(2)
#pragma GCC optimize(3)

#include <bits/stdc++.h>

using namespace std;
typedef long long LL;
const int N = 2e6 + 3;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
int cnt[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    for (int i = 1; i < N; i++) {
        for (int j = i; j < N; j += i) {
            cnt[j]++;
        }
    }
    int l, r;
    cin >> l >> r;
    int pre = 0, ans;
    for (int i = l; i <= r; i++) {
        if (cnt[i] > pre) {
            pre = cnt[i];
            ans = i;
        }
    }
    cout << pre << '\n';
    return 0;
}
